package com.maishi.programmer.jainzhioffer;

/**
 * Created by brossdong on 2018/3/30.
 * 操作给定的二叉树，将其变换为源二叉树的镜像
 */
public class TestProblem27 {

    //构造树
    public class TreeNode {
        int val = 0;
        TreeNode left = null;
        TreeNode right = null;
        public TreeNode (int val) {
            this.val = val;
        }
    }

    public void Mirror (TreeNode root) {
        //空树
        if (root == null) return;
        //只有一个根
        if (root.left == null && root.right == null) return;
        //
        TreeNode temp = root.left;
        root.left = root.right;
        root.right = temp;
        Mirror(root.left);
        Mirror(root.right);

    }

}
